Good state transition policies for nondeterministic and stochastic automata
نویسندگان
چکیده
منابع مشابه
Nondeterministic state complexity of nested word automata
We study the nondeterministic state complexity of Boolean operations on regular languages of nested words. For union and intersection we obtain matching upper and lower bounds. For complementation of a nondeterministic nested word automaton with n states we establish a lower boundΩ( √ n!) that is significantly worse than the exponential lower bound for ordinary nondeterministic finite automata ...
متن کاملUniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chains with process terms. The transition relation assigns to each process, for each action, the set of possible futures paired with a measure indicating the rates at which they are reached. RTS have been shown to be a uni...
متن کاملNondeterministic and Stochastic Cellular Automata and Virus Dynamics
We discuss topological dynamical properties of stochastic cellular automata and nondeterministic cellular automata in the context of virus dynamics models. We consider surjectivity and topological transitivity, and we apply our definitions and results to existing models of dynamics that exhibit different behavior and capture properties of HIV and Ebola virus, labelling the behavior as H-dynamic...
متن کاملRequiring Multiplicity for Nondeterministic Automata
This paper is the second in a series of papers to formalize the proof presented in [1] that the set difference between NP and P is not the empty set . The critical difference between the proof presented in [1] and previous attempts at this problem is that the proof in [1] focuses on the nature of the answers to our set of problems belonging to P and NP instead of the set of problem directly. I...
متن کاملState Complexity of Nondeterministic Finite Automata with Limited Nondeterminism
Various approaches of quantifying nondeterminism in nondeterministic finite automata (NFA) are considered. We consider nondeterministic finite automata having finite tree width (ftw-NFA) where the computation on any input string has a constant number of branches. We give effective characterizations of ftw-NFAs and a tight bound for determinizing an ftw-NFA A as a function of the tree width and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1980
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(80)90703-2